Scheduling EURO-k conferences

Improving Conferences through Session Scheduling

A computer program that schedules a conference's concurrent sessions can enhance participants' conference experience—and gives hoteliers an opportunity to offer (and maybe charge for) a new service.

K-processor Scheduling

It is shown that the Precedence Constrained K-Processor Scheduling problem is W2]-hard. This means that there does not exist a constant c, such that for all xed K, the Precedence Constrained K-Processor Scheduling problem can be solved in O(n c) time, unless an unlikely collapse occurs in the parameter-ized complexity hierarchy introduced by Downey and Fellows (see 5]). That is, if the problem ...

Past Conferences

Past Conferences

Past Conferences